Computing call-blocking probabilities in LEO satellite networks: the single-orbit case

Computing call-blocking probabilities in LEO satellite networks: the single-orbit case

We study the problem of carrying voice calls over a low-earth-orbit satellite network and present an analytical model for computing call-blocking probabilities for a single orbit of a satellite constellation. We have devised a method to solve the corresponding Markov process efficiently for orbits of up to five satellites. For orbits consisting of a larger number of satellites, we have develope...

Call Blocking Probabilities in LEO Satellite Networks : The Single Orbit Case

We study the problem of carrying voice calls over a LEO satellite network, and we present an analytical model for computing call blocking probabilities for a single orbit of a satellite constellation. We have devised a method to solve the corresponding Markov process eÆciently for up to 5-satellite orbits. For orbits consisting of a larger number of satellites, we have developed an approximate ...

Computing Call Blo king Probabilities in LEO Satellite Networks: The Single Orbit Case

Computing call-blocking probabilities in LEO satellite constellations

We present an analytical model for computing call-blocking probabilities in a low earth orbit (LEO) satellite network that carries voice calls. Both satelliteand earth-fixed constellations with interorbit links and handoffs are considered. In this model, we assume a single beam per satellite. Also, we assume that call arrivals are Poisson with a fixed arrival rate that is independent of the geo...

Computing Call Blo king Probabilities in LEO Satellite Networks